# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase, array_to_list, list_to_array


class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def splitListToParts(self, head: ListNode, k: int) -> List[ListNode]:
        count = 0
        p = head

        while p:
            count += 1
            p = p.next

        avg_list_length = count // k
        add_one_list = count % k

        ans = [None for _ in range(k)]

        curr = head
        for i in range(k):
            if curr is None:
                break
            list_length = avg_list_length + (1 if i < add_one_list else 0)
            ans[i] = curr
            for _ in range(0, list_length - 1, 1):
                curr = curr.next

            if curr:
                p_nxt = curr.next
                curr.next = None
                curr = p_nxt

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1, 2, 3], 5, [[1], [2], [3], [], []]),
        ([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 3, [[1, 2, 3, 4], [5, 6, 7], [8, 9, 10]])
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.splitListToParts(array_to_list(input1), input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

